Hypercomputing the Mandelbrot Set?
نویسنده
چکیده
The Mandelbrot set is an extremely well-known mathematical object that can be described in a quite simple way but has very interesting and non-trivial properties. This paper surveys some results that are known concerning the (non-)computability of the set. It considers two models of decidability over the reals (which are treated much more thoroughly and technically in [1], [2], [3] and [4] among others), two over the computable reals (the Russian school and hypercomputation) and a model over the rationals.
منابع مشابه
Extension of the Douady-Hubbard's Theorem on Connectedness of the Mandelbrot Set to Symmetric Polynimials
متن کامل
A Generalized Mandelbrot Set Based On Distance Ratio
The iteration of complex function can generate beautiful fractal images. This paper presents a novel method based on the iteration of the distance ratio with two points, which generates a generalized Mandelbrot set according to distance ratio convergence times. This paper states the definition of distance ratio and its iteration. Then taking the complex function f(z)=z+c for example, it discuss...
متن کاملDynamics of Mandelbrot Set with Transcendental Function
These days Mandelbrot set with transcendental function is an interesting area for mathematicians. New equations have been created for Mandelbrot set using trigonometric, logarithmic and exponential functions. Earlier, Ishikawa iteration has been applied to these equations and generate new fractals named as Relative Superior Mandelbrot Set with transcendental function. In this paper, the Mann it...
متن کاملLocal Connectivity of the Mandelbrot Set at Certain Infinitely Renormalizable Points
We construct a subset of the Mandelbrot set which is dense on the boundary of the Mandelbrot set and which consists of only infinitely renormalizable points such that the Mandelbrot set is locally connected at every point of this subset. We prove the local connectivity by finding bases of connected neighborhoods directly.
متن کاملIs the Mandelbrot set computable?
We discuss the question whether the Mandelbrot set is computable. The computability notions which we consider are studied in computable analysis and will be introduced and discussed. We show that the exterior of the Mandelbrot set, the boundary of the Mandelbrot set, and the hyperbolic components satisfy certain natural computability conditions. We conclude that the two–sided distance function ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cs/0604003 شماره
صفحات -
تاریخ انتشار 2006